A Partial Taxonomy of Substitutability and Interchangeability

نویسندگان

  • Shant Kirakos Karakashian
  • Robert J. Woodward
  • Berthe Y. Choueiry
  • Steven Prestwhich
  • Eugene C. Freuder
چکیده

Substitutability, interchangeability and related concepts in Constraint Programming were introduced approximately twenty years ago and have given rise to considerable subsequent research. We survey this work, classify, and relate the different concepts, and indicate directions for future work, in particular with respect to making connections with research into symmetry breaking. This paper is a condensed version of a larger work in progress.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Conditional interchangeability and substitutability ∗

In a constraint satisfaction problem, two values of a variable are interchangeable if every solution involving one value remains a solution with the value replaced by the other one. Although interchangeability occurs in many problems, there are also problems where little interchangeability occurs. In this paper, we study conditional interchangeability and substitutability for problems where val...

متن کامل

A Definition of Interchangeability for Soft CSPs

Substitutability and interchangeability in constraint satisfaction problems (CSPs) have been used as a basis for search heuristics, solution adaptation and abstraction techniques. In this paper, we consider how the same concepts can be extended to soft constraint satisfaction problems (SCSPs). We introduce two notions: threshold α and degradation δ for substitutability and interchangeability, (...

متن کامل

Interchangeability in Soft CSPs

Substitutability and interchangeability in constraint satisfaction problems (CSPs) have been used as a basis for search heuristics, solution adaptation and abstraction techniques. In this paper, we consider how the same concepts can be extended to soft constraint satisfaction problems (SCSPs). We introduce two notions: threshold α and degradation δ for substitutability and interchangeability, (...

متن کامل

Full Dynamic Substitutability by SAT Encoding

Symmetry in constraint problems can be exploited to greatly improve search performance. A form of symmetry that has been the subject of considerable research is value interchangeability. Automatically detecting full interchangeability is thought to be intractable, so research has focused on either discovery of local interchangeability or programmer knowledge of full interchangeability. This pap...

متن کامل

Soft Interchangeability for Case Adaptation

In [1] we propose interchangeability based algorithms as methods for solving the case adaptation for the domain of problems which can be expressed as Constraint Satisfaction Problems. In this paper we extend the domain to Soft Constraint Satisfaction Problems and give generic adaptation methods based on soft interchangeability concepts. Many real-life problems require the use of preferences. Th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1010.4609  شماره 

صفحات  -

تاریخ انتشار 2010